Stubborn Sets for Model Checking the EF/AG Fragment of CTL
نویسنده
چکیده
The general stubborn set approach to CTL model checking has the drawback that one either nds a stubborn set with only one enabled transition or one has to expand all enabled transitions This restriction does not apply in our approach to a fragment of CTL Fur thermore our reduction does not depend on the invisibility of transitions in a stubborn set
منابع مشابه
Model Checking CTL Properties of Pushdown Systems
A pushdown system is a graph G(P ) of configurations of a pushdown automaton P . The model checking problem for a logic L is: given a pushdown automaton P and a formula α ∈ L decide if α holds in the vertex of G(P ) which is the initial configuration of P . Computation Tree Logic (CTL) and its fragment EF are considered. The model checking problems for CTL and EF are shown to be EXPTIME-complet...
متن کاملBranching-Time Model Checking of One-Counter Processes and Timed Automata
One-counter automata (OCA) are pushdown automata which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) on transition systems induced by one-counter automata. A PSPACE upper bound is inherited from the modal μ-calculus for this problem proven by Serre. First, we analyze the periodic behaviour of CTL over OCA and derive ...
متن کاملStubborn Sets for Fully Observable Nondeterministic Planning
The stubborn set method is a state-space reduction technique, originally introduced in model checking and then transfered to classical planning. It was shown that stubborn sets significantly improve the performance of optimal deterministic planners by considering only a subset of applicable operators in a state. Fully observable nondeterministic planning (FOND) extends the formalism of classica...
متن کاملDecidability of model checking with the temporal logic EF
The branching-time temporal logic EF is a simple, but natural fragment of computation tree logic (CTL) and the modal-calculus. We study the decidability of the model checking problem for EF and innnite-state systems. We use process rewrite systems (PRS) to describe innnite-state systems and deene a hierarchy of subclasses of PRS that includes Petri nets, pushdown processes, Basic Parallel Proce...
متن کاملEquivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic
We show that model-checking flat counter systems over CTL* (with arithmetical constraints on counter values) has the same complexity as the satisfiability problem for Presburger arithmetic. The lower bound already holds with the temporal operator EF only, no arithmetical constraints in the logical language and with guards on transitions made of simple linear constraints. This complements our un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 43 شماره
صفحات -
تاریخ انتشار 2000